Capturing an Evader in a Polygonal Environment with Obstacles
نویسندگان
چکیده
We study a pursuit-evasion game in which one or more cops try to capture a robber by moving onto the robber’s current location. All players have equal maximum velocities. They can observe each other at all times. We show that three cops can capture the robber in any polygonal environment (which can contain any finite number of holes).
منابع مشابه
Capturing an evader in polygonal environments with obstacles: The full visibility case
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know the evader’s current position through the camera network, but need to physically ...
متن کاملA Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader e is chased by pursuers p1, p2, . . . , p`. The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each pi can move to any point at distance at most 1 from his current l...
متن کاملCatch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles
We resolve a several-years old open question in visibilitybased pursuit evasion: how many pursuers are needed to capture an evader in an arbitrary polygonal environment with obstacles? The evader is assumed to be adversarial, moves with the same maximum speed as pursuers, and is “sensed” by a pursuer only when it lies in line-of-sight of that pursuer. The players move in discrete time steps, an...
متن کاملCapturing an Evader in Polygonal Environments: A Complete Information Game
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know the evader's current position through the camera network, but need to physically ...
متن کاملLocating and Capturing an Evader in a Polygonal Environment
This paper contains two main results: First, we revisit the well-known visibility based pursuit-evasion problem and show that, in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simplyconnected polygonal environment using a randomized strategy. The evader can be arbitrarily faster than the pursuer and it may know the position of the pursuer at al...
متن کامل